Bondage number of planar graphs
نویسندگان
چکیده
منابع مشابه
On the bondage number of planar and directed graphs
The bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smallest set E of edges of G such that the graph G − E has domination number greater than that of G. In this paper we present a simplified proof that b(G) ≤ min{8,∆(G) + 2} for all planar graphs G, give examples of planar graphs with bondage number 6, and bound the bondage number of directed graphs.
متن کاملThe Bondage Number of Random Graphs
A dominating set of a graph is a subset D of its vertices such that every vertex not in D is adjacent to at least one member of D. The domination number of a graph G is the number of vertices in a smallest dominating set of G. The bondage number of a nonempty graph G is the size of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination...
متن کاملNote on Conjectures of Bondage Numbers of Planar Graphs
The bondage number of a graph G is the cardinality of a smallest set of edges whose removal results in a graph with domination number larger than that of G. The bondage number measures to some extent the robustness of a network with respect to link failure. This note mainly considers some conjectures on the bondage number of a planar graph, and shows limitations of known methods and presents so...
متن کاملThe bondage number of graphs: good and bad vertices
The domination number γ(G) of a graph G is the minimum number of vertices in a set D such that every vertex of the graph is either in D or is adjacent to a member of D. Any dominating set D of a graph G with |D| = γ(G) is called a γ-set of G. A vertex x of a graph G is called: (i) γ-good if x belongs to some γ-set and (ii) γ-bad if x belongs to no γ-set. The bondage number b(G) of a nonempty gr...
متن کاملNote on the bondage number of graphs on topological surfaces
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. In this paper, we present new upper bounds for b(G) in terms of girth, order and Euler characteristic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00405-7